A Representation Theorem for union-difference
نویسنده
چکیده
We give a quadratic O(|X|) space representation based on a canonical tree for any subset family F ⊆ 2 closed under the union and the difference of its overlapping members. The cardinality of F is potentially in O(2), and the total cardinality of its members even higher. As far as we know this is the first representation result for such families. As an application of this framework we obtain a unique digraph decomposition that not only captures, but also is strictly more powerful than the well-studied modular decomposition. A polynomial time decomposition algorithm for this case is described.
منابع مشابه
ON THE SYSTEM OF LEVEL-ELEMENTS INDUCED BY AN L-SUBSET
This paper focuses on the relationship between an $L$-subset and the system of level-elements induced by it, where the underlying lattice $L$ is a complete residuated lattice and the domain set of $L$-subset is an $L$-partially ordered set $(X,P)$. Firstly, we obtain the sufficient and necessary condition that an $L$-subset is represented by its system of level-elements. Then, a new representat...
متن کاملA Representation Theorem for Union-Difference Families and Application
We give a quadratic O(|X|) space representation based on a canonical tree for any subset family F ⊆ 2 holding the closure under union and difference of overlapping members. The cardinal of F is potentially in O(2), and its size higher. As far as we know this is the first representation theorem for such families. As an application of this framework we obtain a uniqueness decomposition theorem on...
متن کاملFrobenius kernel and Wedderburn's little theorem
We give a new proof of the well known Wedderburn's little theorem (1905) that a finite division ring is commutative. We apply the concept of Frobenius kernel in Frobenius representation theorem in finite group theory to build a proof.
متن کاملComputing the Canonical Representation of Constructible Sets
In the basic paper defining the Gröbner Cover [16] for discussing parametric polynomial systems of equations, we 8 introduced algorithms that have been improved since then. We used our own algorithm buildtree for computing 9 the initial Comprehensive Gröbner System (CGS), needed for the Gröbner Cover, now substituted in the Singular [7] 10 library “grobcov.lib” by themore efficientKapur–Sun–Wan...
متن کاملExamples of non-quasicommutative semigroups decomposed into unions of groups
Decomposability of an algebraic structure into the union of its sub-structures goes back to G. Scorza's Theorem of 1926 for groups. An analogue of this theorem for rings has been recently studied by A. Lucchini in 2012. On the study of this problem for non-group semigroups, the first attempt is due to Clifford's work of 1961 for the regular semigroups. Since then, N.P. Mukherjee in 1972 studied...
متن کامل